linearly ordered by inclusion

См. также в других словарях:

• Primary cyclic group — A primary cyclic group is a cyclic group of prime power order:C {p^m};(for any prime p , and natural number m ).Every finite abelian group G may be written as a finite direct sum of primary cyclic groups::G=igoplus {1leq i leq n}C p i}^{m i;This …   Wikipedia

• Z-group — In mathematics, especially in the area of algebra known as group theory, the term Z group refers to a number of distinct types of groups: * in the study of finite groups, a Z group is a finite groups whose Sylow subgroups are all cyclic. * in the …   Wikipedia

• Cyclic order — In mathematics, a cyclic order is a way to arrange a set of objects in a circle.[nb] Unlike most structures in order theory, a cyclic order cannot be modeled as a binary relation a < b . One does not say that east is more clockwise than west.… …   Wikipedia

• Outline of algebraic structures — In universal algebra, a branch of pure mathematics, an algebraic structure is a variety or quasivariety. Abstract algebra is primarily the study of algebraic structures and their properties. Some axiomatic formal systems that are neither… …   Wikipedia

• List of algebraic structures — In universal algebra, a branch of pure mathematics, an algebraic structure is a variety or quasivariety. Abstract algebra is primarily the study of algebraic structures and their properties. Some axiomatic formal systems that are neither… …   Wikipedia

• Net (mathematics) — This article is about nets in topological spaces and not about ε nets in other fields. In mathematics, more specifically in general topology and related branches, a net or Moore–Smith sequence is a generalization of the notion of a sequence. In… …   Wikipedia

• Dedekind cut — Dedekind used his cut to construct the irrational, real numbers. In mathematics, a Dedekind cut, named after Richard Dedekind, is a partition of the rationals into two non empty parts A and B, such that all elements of A are less than all… …   Wikipedia

• Order theory — For a topical guide to this subject, see Outline of order theory. Order theory is a branch of mathematics which investigates our intuitive notion of order using binary relations. It provides a formal framework for describing statements such as… …   Wikipedia

• Total order — In set theory, a total order, linear order, simple order, or (non strict) ordering is a binary relation (here denoted by infix ≤) on some set X. The relation is transitive, antisymmetric, and total. A set paired with a total order is called a… …   Wikipedia

• Chain complete — In mathematics, a partially ordered set in order theory is chain complete if every chain in it has a least upper bound. Unlike complete posets, chain complete posets are relatively common. Examples include: Any complete poset The set of all… …   Wikipedia

• Heyting algebra — In mathematics, Heyting algebras are special partially ordered sets that constitute a generalization of Boolean algebras, named after Arend Heyting. Heyting algebras arise as models of intuitionistic logic, a logic in which the law of excluded… …   Wikipedia